Approximation theory

Results: 831



#Item
71Computational complexity theory / Mathematics / Theory of computation / NP-complete problems / Operations research / Set cover problem / Approximation algorithm / Facility location problem / Dominating set / Combinatorial optimization / Reduction / Algorithm

Approximation Algorithms for the Class Cover Problem Adam Cannon and Lenore Cowen  Department of Mathematical Sciences Johns Hopkins University Baltimore, MD 21218

Add to Reading List

Source URL: www.cs.tufts.edu

Language: English - Date: 2012-10-31 09:54:20
72Statistics / Statistical theory / Probability / Bayesian statistics / Stochastic processes / Probability distributions / Estimation theory / Statistical natural language processing / Dirichlet process / Mixture model / Variational Bayesian methods / Dirichlet distribution

Online Learning of Nonparametric Mixture Models via Sequential Variational Approximation Dahua Lin Toyota Technological Institute at Chicago

Add to Reading List

Source URL: dahua.me

Language: English - Date: 2013-10-22 19:40:40
73Signal processing / Mathematics / Algebra / Electrical engineering / Matching pursuit / Sparse approximation / Babel function / Coherence / Wavelet / Algorithm / Approximation algorithm / Linear programming

IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 50, NO. 10, OCTOBERGreed is Good: Algorithmic Results for Sparse Approximation

Add to Reading List

Source URL: users.cms.caltech.edu

Language: English - Date: 2007-09-11 17:01:55
74Lattice models / Physics / Particle physics / Theoretical physics / Lattice QCD / Lattice gauge theory / Quantum chromodynamics / Lattice field theory / CLEO / Quenched approximation / Quark

Charm physics on the lattice with highly improved staggered quarks Eduardo Follana The Ohio State University (Fermilab, April 2008)

Add to Reading List

Source URL: theory.fnal.gov

Language: English - Date: 2015-04-03 15:19:43
75Routing / Approximation algorithm / Binary trees / Computing / Coding theory / Routing algorithms / Discrete mathematics

Tight Bounds for Delay-Sensitive Aggregation Yvonne Anne Oswald Stefan Schmid Roger Wattenhofer

Add to Reading List

Source URL: disco.ethz.ch

Language: English - Date: 2014-09-26 08:36:31
76Physics / Chemistry / Theoretical chemistry / Computational chemistry / Molecular modelling / Quantum chemistry / CarParrinello molecular dynamics / Density functional theory / Molecular dynamics / BornOppenheimer approximation / Path integral formulation / Fractional quantum mechanics

Ab initio path integral molecular dynamics: Basic ideas Dominik Marx and Michele Parrinello Max-Planck-Institut fu¨r Festko¨perforschung, Heisenbergstr. 1, 70569 Stuttgart, Germany ~Received 12 October 1995; accepted 6

Add to Reading List

Source URL: ftp.theochem.ruhr-uni-bochum.de

Language: English - Date: 2001-11-05 09:00:44
77Mathematics / Computational complexity theory / Graph theory / NP-complete problems / Operations research / Travelling salesman problem / Theoretical computer science / Approximation algorithm / Steiner tree problem / Greedy algorithm / Optimization problem / Set cover problem

CS261: Exercise Set #8 For the week of February 22–26, 2016 Instructions: (1) Do not turn anything in. (2) The course staff is happy to discuss the solutions of these exercises with you in office hours or on Piazza.

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2016-02-26 12:53:21
78Graph theory / Mathematics / Routing algorithms / Edsger W. Dijkstra / Combinatorial optimization / Search algorithms / Game artificial intelligence / A* search algorithm / Shortest path problem / Flow network / Tree / Graph

Hardness and Approximation Results for Black Hole Search in Arbitrary Networks⋆ Ralf Klasing⋆⋆, Euripides Markou⋆ ⋆ ⋆ , Tomasz Radzik† , and Fabiano Sarracco‡ Abstract. A black hole is a highly harmful st

Add to Reading List

Source URL: emarkou.users.uth.gr

Language: English - Date: 2016-05-24 11:28:43
79Graph theory / Computational complexity theory / Mathematics / NP-complete problems / Spanning tree / Steiner tree problem / Operations research / Knowledge representation / Edsger W. Dijkstra / Minimum spanning tree / Travelling salesman problem / Approximation algorithm

Robust Reoptimization of Steiner Trees∗ Keshav Goyal1 and Tobias Mömke2 1 2 IIT Delhi, India,

Add to Reading List

Source URL: drops.dagstuhl.de

Language: English - Date: 2015-12-11 12:58:32
80Mathematical analysis / Mathematics / Orthogonal polynomials / Approximation theory / Chebyshev polynomials / Sequence space / Limit of a function

arXiv:1011.3159v1 [math.SP] 13 Nov 2010

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2010-11-15 22:26:01
UPDATE